package day11;

import java.util.Scanner;

//最长连续bit位
public class oj2 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int n = in.nextInt();
            int count = 0;
            int modCount = 0;
            while(n != 0) {

                if((n&1)==1){
                    count++;
                    modCount=Math.max(count,modCount);
                } else {
                    count = 0;
                }
                n = n>>1;
            }
            System.out.println(modCount);

        }
    }
}
